Assessing the effects of abstract attributes and brand familiarity in conjoint choice experiments

The paper considers a (static) portfolio system that satisfies adding-up contraints and the gross substitution theorem. The paper shows the relationship of the two conditions to the weak dominant diagonal property of the matrix of interest rate elasticities. This enables to investigate the impact of simultaneous changes in interest rates on the asset demands.

Semiparametric estimation of (constrained) ultrametric trees

This paper introduces a general, formal treatment of dynamic constraints, i.e., constraints on the state changes that are allowed in a given state space. Such dynamic constraints can be seen as representations of "real world" constraints in a managerial context. The notions of transition, reversible and irreversible transition, and transition relation will be introduced. The link with Kripke models (for modal logics) is also made explicit. Several (subtle) examples of dynamic constraints will be given. Some important classes of dynamic constraints in a database context will be identified, e.g. various forms of cumulativity, non-decreasing values, constraints on initial and final values, life cycles, changing life cycles, and transition and constant dependencies. Several properties of these dependencies will be treated. For instance, it turns out that functional dependencies can be considered as "degenerated" transition dependencies. Also, the distinction between primary keys and alternate keys is reexamined, from a dynamic point of view.

Undirected visual attention to advertising : a segment-level analysis

The paper considers a (static) portfolio system that satisfies adding-up contraints and the gross substitution theorem. The paper shows the relationship of the two conditions to the weak dominant diagonal property of the matrix of interest rate elasticities. This enables to investigate the impact of simultaneous changes in interest rates on the asset demands.

Differentiated Bayesian Conjoint Choice Designs

Previous conjoint choice design construction procedures have produced a single design that is administered to all subjects. This paper proposes to construct a limited set of different designs. The designs are constructed in a Bayesian fashion, taking into account prior uncertainty about the parameter values. A computational procedure is developed that enables fast and easy implementation in practice. Even though the number of such different designs in the optimal set is small, it is demonstrated through a Monte Carlo study that substantial gains in efficiency are achieved over aggregate designs